Inertial Tseng Method for Solving the Variational Inequality Problem and Monotone Inclusion Problem in Real Hilbert Space
نویسندگان
چکیده
The main aim of this research is to introduce and investigate an inertial Tseng iterative method approximate a common solution for the variational inequality problem γ-inverse strongly monotone mapping inclusion in real Hilbert spaces. We establish strong convergence theorem our suggested proposed problems under some certain mild conditions. Furthermore, we deduce consequence from result. Finally, numerical experiment presented demonstrate effectiveness method. methodology described paper extend unify previously published findings field.
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولReproducing Kernel Hilbert Space(RKHS) method for solving singular perturbed initial value problem
In this paper, a numerical scheme for solving singular initial/boundary value problems presented.By applying the reproducing kernel Hilbert space method (RKHSM) for solving these problems,this method obtained to approximated solution. Numerical examples are given to demonstrate theaccuracy of the present method. The result obtained by the method and the exact solution are foundto be in good agr...
متن کاملA general descent framework for the monotone variational inequality problem
We present a framework for descent algorithms that solve the monotone variational inequality problem V IP v which consists in nding a solution v 2 v which satisses s(v) T (u?v) 0, for all u 2 v. This uniied framework includes, as special cases, some well known iterative methods and equivalent optimization formulations. A descent method is developed for an equivalent general optimization formula...
متن کاملGraph Convergence for H(.,.)-co-Accretive Mapping with over-Relaxed Proximal Point Method for Solving a Generalized Variational Inclusion Problem
In this paper, we use the concept of graph convergence of H(.,.)-co-accretive mapping introduced by [R. Ahmad, M. Akram, M. Dilshad, Graph convergence for the H(.,.)-co-accretive mapping with an application, Bull. Malays. Math. Sci. Soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...
متن کاملStrong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
We study two projection algorithms for solving the Variational Inequality Problem (VIP) in Hilbert space. One algorithm is a modi ed subgradient extragradient method in which an additional projection onto the intersection of two half-spaces is employed. Another algorithm is based on the shrinking projection method. We establish strong convergence theorems for both algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10173151